Generalization of Fibonomial Coefficients

نویسنده

  • M. Dziemiańczuk
چکیده

Following Lucas and then other Fibonacci people Kwaśniewski had introduced and had started ten years ago the open investigation of the overall F -nomial coefficients which encompass among others Binomial, Gaussian and Fibonomial coefficients with a new unified combinatorial interpretation expressed in terms of cobweb posets’ partitions and tilings of discrete hyperboxes. In this paper, we deal with special subfamily of T -nomial coefficients. The main aim of this note is to develop the theory of T -nomial coefficients with the help of generating functions. The binomial-like theorem for T -nomials is delivered here and some consequences of it are drawn. A new combinatorial interpretation of T -nomial coefficients is provided and compared with the Konvalina way of objects’ selections from weighted boxes. A brief summary of already known properties of F -nomial coefficients is served.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The p-adic Order of Some Fibonomial Coefficients

In this paper, we consider the Fibonomial coefficients, a natural generalization of the binomial coefficients. We generalize a 2013 result of the authors and J. Sellers by proving an exact divisibility result for Fibonomial coefficients involving powers of primes and confirming a recent conjecture.

متن کامل

Combinatorial derivation of the recurrence relation for fibonomial coefficients

Combinatorial interpretation of the fibonomial coefficients recently proposed by the present author [1,2] here results in combinatorial derivation of the recurrence relation for fibonomial coefficients . The presentation is provided with quite an exhaustive context with reference to classical attitude of [3,4]. This note apart from plane grid coordinate system used is fitted with several figure...

متن کامل

First Remark on a Ζ-analogue of the Stirling Numbers

The so-called ζ-analogues of the Stirling numbers of the first and second kind are considered. These numbers cover ordinary binomial and Gaussian coefficients, p, qStirling numbers and other combinatorial numbers studied with the help of object selection, Ferrers diagrams and rook theory. Our generalization includes these and now also the p, q-binomial coefficients. This special subfamily of F ...

متن کامل

Comments on combinatorial interpretation of fibonomial coefficients - an email style letter

I. Up to our knowledge-since about 126 years we were lacking of classical type combinatorial interpretation of Fibonomial coefficients as it was Lukas [1]-to our knowledge-who was the first who had defined Finono-mial coefficients and derived a recurrence for them (see Historical Note in [2]). Namely as accurately noticed by Knuth and Wilf in [3] the recurrent relations for Fibonomial coefficie...

متن کامل

An Introduction to Finite Fibonomial Calculus

This is an indicatory presentation of main definitions and theorems of Fibonomial Calculus which is a special case of ψ-extented Rota’s finite operator calculus [7]. 1 Fibonomial coefficients The famous Fibonacci sequence{Fn}n≥0

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009